Fast Compensative Design Approach for the Approximate Squaring Function
نویسندگان
چکیده
In this paper, a systematic compensation approach is presented to efficiently design the approximate squaring function with a simple combinational logic circuit. Also, a set of recursive Boolean equations for general outputs is derived such that the logic circuit can be rapidly designed and reused for various bit-width inputs. In logic implementation, our design approach possesses less circuit cost and lower critical delay. Moreover, in error analysis, the maximum relative error (MRE) and average relative error (ARE) of squaring approximation are significantly improved by at least 26.95% and 61.59%, respectively, as compared with the existing approaches. Finally, a 7-bit approximate squaring function chip is accomplished to verify the circuit performance based on 0.6m CMOS technology. The chip layout occupies 127 135 m and the total number of transistors is 186.
منابع مشابه
Fast Squaring Algorithm Design and Complexity Numerical Analyses for Public-Key Cryptosystems
Modular exponentiation is an important operation in several public-key cryptography. The standard squaring algorithm is well-known and the Guajardo-Paar algorithm fixes the improper carry handling bug produced by the standard squaring algorithm, but produces error-indexing bug. In this paper, one squaring algorithm is proposed, which stores base products into the Look-Up Table before the squari...
متن کاملExact and approximate solutions of fuzzy LR linear systems: New algorithms using a least squares model and the ABS approach
We present a methodology for characterization and an approach for computing the solutions of fuzzy linear systems with LR fuzzy variables. As solutions, notions of exact and approximate solutions are considered. We transform the fuzzy linear system into a corresponding linear crisp system and a constrained least squares problem. If the corresponding crisp system is incompatible, then the fuzzy ...
متن کاملA New Approach to Approximate Completion Time Distribution Function of Stochastic Pert Networks
The classical PERT approach uses the path with the largest expected duration as the critical path to estimate the probability of completing a network by a given deadline. However, in general, such a path is not the most critical path (MCP) and does not have the smallest estimate for the probability of completion time. The main idea of this paper is derived from the domination structure between ...
متن کاملADAPTIVE BACKSTEPPING CONTROL OF UNCERTAIN FRACTIONAL ORDER SYSTEMS BY FUZZY APPROXIMATION APPROACH
In this paper, a novel problem of observer-based adaptive fuzzy fractional control for fractional order dynamic systems with commensurate orders is investigated; the control scheme is constructed by using the backstepping and adaptive technique. Dynamic surface control method is used to avoid the problem of “explosion of complexity” which is caused by backstepping design process. Fuzzy logic sy...
متن کاملApproximate Squaring
We study the " approximate squaring " map f (x) := x⌈x⌉ and its behavior when iterated. We conjecture that if f is repeatedly applied to a rational number r = l/d > 1 then eventually an integer will be reached. We prove this when d = 2, and provide evidence that it is true in general by giving an upper bound on the density of the " exceptional set " of numbers which fail to reach an integer. We...
متن کامل